A Graph Partitioning Heuristic for the Parallel Pseudo-exhaustive Logical Test of Vlsi Combinational Circuits
نویسندگان
چکیده
The logical test of integrated VLSI circuits is one of the main phases of their design and fabrication. The pseudo-exhaustive approach for the logical test of integrated circuits consists in partitioning the original circuit to be tested into non-overlapping subcircuits with a small, bounded number of subcircuits, which are then exhaustively tested in parallel. In this work we present an approximate algorithm for the problem of partitioning integrated combinational circuits, based on the tabu search metaheuristic. The proposed algorithm presents several original features, such as: the use of a reduced neighborhood, obtained from moves involving only a subset of boundary nodes; complex moves which entail several resulting moves, although the variations in the cost function are easily computable; a bi-criteria cost function combining the number of subcircuits and the number of cuts, which simultaneously adds a diversiication strategy to the search; and the use of a bin-packing heuristic as a post-optimization step. The behavior of the proposed algorithm was evaluated through its application to a set of benchmark circuits. The computational results have been compared with those obtained by the other algorithms in the literature, with signiicant improvements. The average reduction rates have been of the order of 30% in the number of subcircuits in the partition, and of the order of 40% in the number of cuts.
منابع مشابه
A timing-driven pseudoexhaustive testing for VLSI circuits
Because of its ability to detect all non-redundant combinational faults, exhaustive testing, which applies all possible input combinations to a circuit, has become a very attractive test method. However, the test application time for exhaustive testing can be very large. To reduce the test time, pseudo exhaustive testing inserts some bypass storage cells (bscs) so that the dependency of each no...
متن کاملTree-structured LFSR synthesis scheme for pseudo-exhaustive testing of VLSI circuits - Computers and Digital Techniques, IEE Proceedings-
A new test architecture, called TLS (tree-LFSWSR), generates pseudo-exhaustive test patterns for both combinational and sequential VLSI circuit is presented. Instead of using a single scan chain, the proposed test architecture routes a scan tree driven by the LFSR to generate all possible input pattems for each output cone. The new test architecture is able to take advantages of both signal sha...
متن کاملPerformance trade-offs in a parallel test generation/fault simulation environment
As parallel processing hardware becomes more common and affordable, multiprocessors are being increasingly used to accelerate VLSI CAD algorithms. The problem of partitioning faults in a parallel test generation/ fault simulation (TG/FS) environment has received very little attention in the past. In a parallel TG/FS environment, the fault partitioning method used can have a significant impact o...
متن کاملOptimal and Power Aware BIST for Delay Testing of System-On-Chip
Test engineering for fault tolerant VLSI systems is encumbered with optimization requisites for hardware overhead, test power and test time. The high level quality of these complex high-speed VLSI circuits can be assured only through delay testing, which involves checking for accurate temporal behavior. In the present paper, a data-path based built-in test pattern generator (TPG) that generates...
متن کاملAn efficient CAD tool for High-Level Synthesis of VLSI digital transformers
Digital transformers are considered as one of the digital circuits being widely used in signal and data processing systems, audio and video processing, medical signal processing as well as telecommunication systems. Transforms such as Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Fast Fourier Transform (FFT) are among the ones being commonly used in this area. As an illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994